ABC086 C - Traveling - 競プロ

ABC086 C - Traveling

https://atcoder.jp/contests/abc086/tasks/arc089_a

提出

WA

code: python

n = int(input())

t = []

x = 0

y = 0

for i in range(n):

T, X, Y = int(i) for i in input().split()

t.append(T)

x.append(X)

y.append(Y)

flag = True

for i in range(n):

dis = abs(xi+1 - xi) + abs(yi+1 - yi)

if (ti < dis):

flag = False

print("No")

break

if ((xi+1 + yi+1) % 2 != ti % 2):

flag = False

print("No")

break

if (flag):

print("Yes")

解答

code: python

n = int(input())

t = 0

x = 0

y = 0

for i in range(n):

T, X, Y = int(i) for i in input().split()

t.append(T)

x.append(X)

y.append(Y)

flag = True

for i in range(n):

dt = ti+1 - ti

dis = abs(xi+1 - xi) + abs(yi+1 - yi)

if (dt < dis):

flag = False

print("No")

break

if (dis % 2 != dt % 2):

flag = False

print("No")

break

if (flag):

print("Yes")

テーマ

メモ

その地点ごとの距離と時間で判断する

提出

code: python

n = int(input())

txy = list(map(int, input().split())) for _ in range(n)

txy.insert(0, 0, 0, 0)

for i in range(n):

time = txyi+10 - txyi0

dis = abs(txyi+11 - txyi1) + abs(txyi+12 - txyi2)

if dis > time:

print("No")

exit()

if time % 2 != dis % 2:

print("No")

exit()

print("Yes")